Fast Correlation Computation Method for Matching Pursuit Algorithms in Compressed Sensing
نویسندگان
چکیده
There have been many matching pursuit algorithms (MPAs) which handle the sparse signal recovery problem a.k.a. compressed sensing (CS). In the MPAs, the correlation computation step has a dominant computational complexity. In this letter, we propose a new fast correlation computation method when we use some classes of partial unitary matrices as the sensing matrix. Those partial unitary matrices include partial Fourier matrices and partial Hadamard matrices which are popular sensing matrices. The proposed correlation computation method can be applied to almost all MPAs without causing any degradation of their recovery performance. And, for most practical parameters, the proposed method can reduce the computational complexity of the MPAs substantially. Index Terms compressed sensing (CS), fast correlation computation, Fourier matrix, Hadamard matrix, matching pursuit algorithm (MPA).
منابع مشابه
Fast Correlation Method for Partial Fourier and Hadamard Sensing Matrices in Matching Pursuit Algorithms
SUMMARY There have been many matching pursuit algorithms (MPAs) which handle the sparse signal recovery problem, called compressed sensing (CS). In the MPAs, the correlation step makes a dominant computational complexity. In this paper, we propose a new fast correlation method for the MPA when we use partial Fourier sensing matrices and partial Hadamard sensing matrices which are widely used as...
متن کاملModified Orthogonal Matching Pursuit Algorithm for Cognitive Radio Wideband Spectrum Sensing
Sampling rate is the bottleneck for spectrum sensing over multi-GHz bandwidth. Recent progress in compressed sensing (CS) initialized several sub-Nyquist rate approaches to overcome the problem. However, efforts to design CS reconstruction algorithms for wideband spectrum sensing are very limited. It is possible to further reduce the sampling rate requirement and improve reconstruction performa...
متن کاملA Block-Wise random sampling approach: Compressed sensing problem
The focus of this paper is to consider the compressed sensing problem. It is stated that the compressed sensing theory, under certain conditions, helps relax the Nyquist sampling theory and takes smaller samples. One of the important tasks in this theory is to carefully design measurement matrix (sampling operator). Most existing methods in the literature attempt to optimize a randomly initiali...
متن کاملOne-Bit Compressed Sensing by Greedy Algorithms
Sign truncated matching pursuit (STrMP) algorithm is presented in this paper. STrMP is a new greedy algorithm for the recovery of sparse signals from the sign measurement, which combines the principle of consistent reconstruction with orthogonal matching pursuit (OMP). The main part of STrMP is as concise as OMP and hence STrMP is simple to implement. In contrast to previous greedy algorithms f...
متن کاملSplitting Matching Pursuit Method for Reconstructing Sparse Signal in Compressed Sensing
In this paper, a novel method named as splitting matching pursuit (SMP) is proposed to reconstructK-sparse signal in compressed sensing.The proposedmethod selectsFl (Fl > 2K) largest components of the correlation vector c, which are divided intoF split sets with equal length l.The searching area is thus expanded to incorporatemore candidate components, which increases the probability of finding...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1205.4139 شماره
صفحات -
تاریخ انتشار 2012